See cellular automaton on Wiktionary
{
"forms": [
{
"form": "cellular automata",
"tags": [
"plural"
]
},
{
"form": "cellular automatons",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "cellular automata",
"2": "s"
},
"expansion": "cellular automaton (plural cellular automata or cellular automatons)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "Entries with translation boxes",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Finnish translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with French translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Mandarin translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Russian translations",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Terms with Serbo-Croatian translations",
"parents": [],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Cellular automata",
"orig": "en:Cellular automata",
"parents": [
"Mathematics",
"Theory of computing",
"Formal sciences",
"Computer science",
"Sciences",
"Computing",
"All topics",
"Technology",
"Fundamental"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Mathematics",
"orig": "en:Mathematics",
"parents": [
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"derived": [
{
"word": "block cellular automaton"
},
{
"word": "elementary cellular automaton"
},
{
"word": "Life-like cellular automaton"
},
{
"word": "partitioning cellular automaton"
}
],
"examples": [
{
"ref": "1989 March 21, Dave Hiebeler, “Fast LIFE (was: Re: summing 9-cell neighborhoods)”, in comp.theory.cell-automata (Usenet):",
"text": "Or maybe just taking some precautions when setting up the division scheme for a particular cellular automaton might be good enough in other cases, depending on how dynamic and non-homogeneous the behavior over the grid will be.",
"type": "quote"
},
{
"ref": "2003 October 8, Edwin Clark, “a puzzle related to artinian group”, in comp.theory.cell-automata (Usenet):",
"text": "For fixed n this is, of course, a cellular automaton. You can allow any positive integer states for each of the n cells. The transition rule is such that if a cell has state x >=2 then the state never exceeds x and if it has state x < 2 then it either stays the same or increase by 1 or 2.",
"type": "quote"
},
{
"ref": "2012 July 3, Mike James, “A New Computational Universe - Fredkin's SALT CA”, in www.i-programmer.info, retrieved 2012-10-25:",
"text": "The paper concludes:\nThe Busy Boxes variant of the SALT family of reversible cellular automata has shown itself to possess an intriguing number of features that are worthy of further study and analysis. Physicist Gerard T'Hooft has written about the possibility that reversible CA's such as this one may help elucidate some aspects of physics in the quantum realm [5]. We believe that the study of emergent, qualitative, and statistically predictable behavior of these kinds of discrete, deterministic systems can indeed shed light on questions in physics, and may also help to clarify the deeper principles of entropy and the origin of complex, self-propagating systems such as those found in our biosphere",
"type": "quote"
},
{
"ref": "2013 June 19, Aaron Ball, “Sierpinski's triangles generated from cellular automaton in Golly”, in comp.theory.cell-automata (Usenet):",
"text": "Hello, I have recently constructed a cellular automaton in Golly, with a starting population of roughly 899 million, that produces Shierpinski's triangles.",
"type": "quote"
}
],
"glosses": [
"An automaton consisting of cells arranged in a regular grid, in one or more dimensions. Each application of an associated rule creates a new generation, where the cells have a new configuration of values."
],
"id": "en-cellular_automaton-en-noun-JVXKelGK",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"cell",
"cell"
],
[
"grid",
"grid"
],
[
"dimension",
"dimension"
],
[
"rule",
"rule"
],
[
"generation",
"generation"
]
],
"raw_glosses": [
"(computing theory) An automaton consisting of cells arranged in a regular grid, in one or more dimensions. Each application of an associated rule creates a new generation, where the cells have a new configuration of values."
],
"related": [
{
"word": "pushdown automaton"
},
{
"word": "Turing machine"
}
],
"synonyms": [
{
"word": "CA"
}
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"translations": [
{
"code": "cmn",
"lang": "Chinese Mandarin",
"roman": "yuán bāo zì dòng jī",
"sense": "automaton",
"word": "元胞自动机"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "automaton",
"word": "soluautomaatti"
},
{
"code": "fr",
"lang": "French",
"sense": "automaton",
"tags": [
"masculine"
],
"word": "automate cellulaire"
},
{
"code": "ru",
"lang": "Russian",
"roman": "klétočnyj avtomát",
"sense": "automaton",
"tags": [
"masculine"
],
"word": "кле́точный автома́т"
},
{
"code": "sh",
"lang": "Serbo-Croatian",
"sense": "automaton",
"tags": [
"masculine"
],
"word": "celularni automat"
},
{
"code": "sh",
"lang": "Serbo-Croatian",
"sense": "automaton",
"tags": [
"masculine"
],
"word": "stanični automat"
}
],
"wikipedia": [
"cellular automaton"
]
}
],
"word": "cellular automaton"
}
{
"derived": [
{
"word": "block cellular automaton"
},
{
"word": "elementary cellular automaton"
},
{
"word": "Life-like cellular automaton"
},
{
"word": "partitioning cellular automaton"
}
],
"forms": [
{
"form": "cellular automata",
"tags": [
"plural"
]
},
{
"form": "cellular automatons",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {
"1": "cellular automata",
"2": "s"
},
"expansion": "cellular automaton (plural cellular automata or cellular automatons)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"related": [
{
"word": "pushdown automaton"
},
{
"word": "Turing machine"
}
],
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"English terms with quotations",
"Entries with translation boxes",
"Pages with 1 entry",
"Pages with entries",
"Terms with Finnish translations",
"Terms with French translations",
"Terms with Mandarin translations",
"Terms with Russian translations",
"Terms with Serbo-Croatian translations",
"en:Cellular automata",
"en:Mathematics",
"en:Theory of computing"
],
"examples": [
{
"ref": "1989 March 21, Dave Hiebeler, “Fast LIFE (was: Re: summing 9-cell neighborhoods)”, in comp.theory.cell-automata (Usenet):",
"text": "Or maybe just taking some precautions when setting up the division scheme for a particular cellular automaton might be good enough in other cases, depending on how dynamic and non-homogeneous the behavior over the grid will be.",
"type": "quote"
},
{
"ref": "2003 October 8, Edwin Clark, “a puzzle related to artinian group”, in comp.theory.cell-automata (Usenet):",
"text": "For fixed n this is, of course, a cellular automaton. You can allow any positive integer states for each of the n cells. The transition rule is such that if a cell has state x >=2 then the state never exceeds x and if it has state x < 2 then it either stays the same or increase by 1 or 2.",
"type": "quote"
},
{
"ref": "2012 July 3, Mike James, “A New Computational Universe - Fredkin's SALT CA”, in www.i-programmer.info, retrieved 2012-10-25:",
"text": "The paper concludes:\nThe Busy Boxes variant of the SALT family of reversible cellular automata has shown itself to possess an intriguing number of features that are worthy of further study and analysis. Physicist Gerard T'Hooft has written about the possibility that reversible CA's such as this one may help elucidate some aspects of physics in the quantum realm [5]. We believe that the study of emergent, qualitative, and statistically predictable behavior of these kinds of discrete, deterministic systems can indeed shed light on questions in physics, and may also help to clarify the deeper principles of entropy and the origin of complex, self-propagating systems such as those found in our biosphere",
"type": "quote"
},
{
"ref": "2013 June 19, Aaron Ball, “Sierpinski's triangles generated from cellular automaton in Golly”, in comp.theory.cell-automata (Usenet):",
"text": "Hello, I have recently constructed a cellular automaton in Golly, with a starting population of roughly 899 million, that produces Shierpinski's triangles.",
"type": "quote"
}
],
"glosses": [
"An automaton consisting of cells arranged in a regular grid, in one or more dimensions. Each application of an associated rule creates a new generation, where the cells have a new configuration of values."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"cell",
"cell"
],
[
"grid",
"grid"
],
[
"dimension",
"dimension"
],
[
"rule",
"rule"
],
[
"generation",
"generation"
]
],
"raw_glosses": [
"(computing theory) An automaton consisting of cells arranged in a regular grid, in one or more dimensions. Each application of an associated rule creates a new generation, where the cells have a new configuration of values."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"wikipedia": [
"cellular automaton"
]
}
],
"synonyms": [
{
"word": "CA"
}
],
"translations": [
{
"code": "cmn",
"lang": "Chinese Mandarin",
"roman": "yuán bāo zì dòng jī",
"sense": "automaton",
"word": "元胞自动机"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "automaton",
"word": "soluautomaatti"
},
{
"code": "fr",
"lang": "French",
"sense": "automaton",
"tags": [
"masculine"
],
"word": "automate cellulaire"
},
{
"code": "ru",
"lang": "Russian",
"roman": "klétočnyj avtomát",
"sense": "automaton",
"tags": [
"masculine"
],
"word": "кле́точный автома́т"
},
{
"code": "sh",
"lang": "Serbo-Croatian",
"sense": "automaton",
"tags": [
"masculine"
],
"word": "celularni automat"
},
{
"code": "sh",
"lang": "Serbo-Croatian",
"sense": "automaton",
"tags": [
"masculine"
],
"word": "stanični automat"
}
],
"word": "cellular automaton"
}
Download raw JSONL data for cellular automaton meaning in All languages combined (4.7kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-11-06 from the enwiktionary dump dated 2024-10-02 using wiktextract (fbeafe8 and 7f03c9b). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.